Dynamics of electromagnetic waves in Kerr geometry

Here we are interested to study the spin-1 particle i.e., electro-magnetic wave in curved space-time, say around black hole. After separating the equations into radial and angular parts, writing them according to the black hole geometry, say, Kerr black hole we solve them analytically. Finally we produce complete solution of the spin-1 particles around a rotating black hole namely in Kerr geometry. Obviously there is coupling between spin of the electro-magnetic wave and that of black hole when particles propagate in that space-time. So the solution will be depending on that coupling strength. This solution may be useful to study different other problems where the analytical results are needed. Also the results may be useful in some astrophysical contexts.Comment: 15 Latex pages, 4 Figures; Accepted for publication in Classical and Quantum Gravit

Same-sign trileptons and four-leptons as signatures of new physics at the Large Hadron Collider

We point out that same-sign multilepton events, not given due attention yet for new physics search, can be extremely useful at the Large Hadron Collider. After showing the easy reducibility of the standard model backgrounds, we demonstrate the viability of same-sign trilepton signals for R-parity breaking supersymmetry, at both 7 and 14 TeV. We find that same-sign four-leptons, too, can have appreciable rates. Same-sign trileptons are also expected, for example, in Little Higgs theories with T-parity broken by anomaly terms.Comment: 5 pages, 1 figure; v2: minor additions to text, references added, version to appear in Physical Review D (Rapid Communications

Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay

We consider the job assignment problem in a multi-server system consisting of $N$ parallel processor sharing servers, categorized into $M$ ($\ll N$) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate $N \lambda$. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is then assigned to one of the sampled servers based on a selection rule. We propose two schemes, each corresponding to a specific selection rule that aims at reducing the mean sojourn time of jobs in the system. We first show that both methods achieve the maximal stability region. We then analyze the system operating under the proposed schemes as $N \to \infty$ which corresponds to the mean field. Our results show that asymptotic independence among servers holds even when $M$ is finite and exchangeability holds only within servers of the same type. We further establish the existence and uniqueness of stationary solution of the mean field and show that the tail distribution of server occupancy decays doubly exponentially for each server type. When the estimates of arrival rates are not available, the proposed schemes offer simpler alternatives to achieving lower mean sojourn time of jobs, as shown by our numerical studies